Magdalena Lemańska WEAKLY CONVEX AND CONVEX DOMINATION NUMBERS

نویسنده

  • Magdalena Lemańska
چکیده

Two new domination parameters for a connected graph G: the weakly convex domination number of G and the convex domination number of G are introduced. Relations between these parameters and the other domination parameters are derived. In particular, we study for which cubic graphs the convex domination number equals the connected domination number.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The convex domination subdivision number of a graph

Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...

متن کامل

Nordhaus-Gaddum results for weakly convex domination number of a graph

Nordhaus-Gaddum results for weakly convex domination number of a graph G are studied.

متن کامل

Joanna Raczek NP - COMPLETENESS OF WEAKLY CONVEX AND CONVEX DOMINATING SET DECISION PROBLEMS

The convex domination number and the weakly convex domination number are new domination parameters. In this paper we show that the decision problems of convex and weakly convex dominating sets are NP -complete for bipartite and split graphs. Using a modified version of Warshall algorithm we can verify in polynomial time whether a given subset of vertices of a graph is convex or weakly convex.

متن کامل

Influence of edge subdivision on the convex domination number

We study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.

متن کامل

Nordhaus-Gaddum results for the convex domination number of a graph

The distance dG(u, v) between two vertices u and v in a connected graph G is the length of the shortest uv-path in G. A uv-path of length dG(u, v) is called uv-geodesic. A set X is convex in G if vertices from all ab-geodesics belong to X for every two vertices a, b ∈ X. The convex domination number γcon(G) of a graph G equals the minimum cardinality of a convex dominating set. There are a larg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004